On the capacity region of the discrete additive multiple-access arbitrarily varying channel

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the capacity region of the discrete additive multiple-access arbitrarily varying channel

The discrete additive multiple-access arbitrarily varying channel (AVC) with two senders and one receiver is considered. Necessary and sufficient conditions are given for its deterministic-code average-probability-of-error capacity region under a state constraint to have a nonempty interior. In the case that no state constraint is present, the capacity region is characterized exactly. In the ca...

متن کامل

Nonconvexity of the capacity region of the multiple-access arbitrarily varying channel subject to constraints

Abstruct-The random-code capacity region of the multiple-access arbitrarily varying channel subject to both state and input constraints is determined. Consideration of a simple erasure channel shows that the capacity region is not convex in general.

متن کامل

Capacity of the Gaussian arbitrarily varying channel

The Gaussian arbitrarily varying channel with input constraint r and state constraint 2 admits input sequences x = ( x l , , x , ~ ) of real numbers with Cxf 5 nT and state sequences s = ( 5 ,. , T , ~ ) of real numbers with L Y ~ 5 H A ; the output sequence x + s + V , where V = ( VI, , y , ) is a sequence of independent and identically distributed Gaussian random variables with mean 0 and var...

متن کامل

On the Capacity Region of Multiple Access Channel

The capacity region of a multiple access channel is discussed. It was found that orthogonal multiple access and non orthogonal multiple access have the same capacity region under the constraint of same sum power.

متن کامل

On the Capacity Region of Multiple Access Adder Channel

The model of communication is as follows (see Fig. 1). Each user i chooses a label mi uniformly from its message set [Mi] and sends the codeword ei(mi). All the users send their codewords simultaneously, symbol by symbol. After n transmissions, a sequence of n output symbols (y1, y2, . . . , yn) is received according to the transition probability matrix. This is then decoded by the decoding fun...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 1992

ISSN: 0018-9448

DOI: 10.1109/18.144713